A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
نویسندگان
چکیده
We present an exact separation scheme for identifying most violated extended cover inequalities for application to multidimensional knapsack problems (MKP). The minimality of the resulting covers is shown to be a basic property of the criterion used for separation, namely the ratio between leftand right-hand sides of the extended cover inequality looked for. Computational results obtained on a set of randomly generated (MKP) instances together with instances from the OR-library with up to 180 variables and 60 constraints show signi5cant reduction in overall computing times as compared with the standard version of Cplex 6.5 in MIP mode using automatic cover inequality generation. c © 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Separation algorithms for 0-1 knapsack polytopes
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To use such inequalities effectively, one needs separation algorithms for them, i.e., routines for detecting when they are violated. We show that the separation problems for the so-called extended cover and weight inequalities can be solved exactly in O(nb) time and O((n+ amax)b)...
متن کاملSeparation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds
M by addressing probabilistic 0–1 programs we study the conic quadratic knapsack polytope with generalized upper bound (GUB) constraints. In particular, we investigate separating and extending GUB cover inequalities. We show that, unlike in the linear case, determining whether a cover can be extended with a single variable is NP-hard. We describe and compare a number of exact and heuristic sepa...
متن کاملOn separating cover inequalities for the multidimensional knapsack problem
We propose a simple and a quite efficient separation procedure to identify cover inequalities for the multidimensional knapsack problem. It is based on the solution of a conventional integer programmingmodel. Solving this kind of integer programs is usually considered expensive and the proposed method may have been overlooked because of this assumption. The results of our experiments with a sma...
متن کاملThe 0-1 Knapsack problem with a single continuous variable
Constraints arising in practice often contain many 0-1 variables and one or a small number of continuous variables. Existing knapsack separation routines cannot be used on such constraints. Here we study such constraint sets, and derive valid inequalities that can be used as cuts for such sets, as well for more general mixed 0-1 constraints. Specifically we investigate the polyhedral structure ...
متن کاملComputational testing of exact mixed knapsack separation for MIP problems
In this paper we study an exact separation algorithm for mixed knapsack sets with the aim of evaluating its effectiveness in a cutting plane algorithm for Mixed-Integer Programming. First proposed by Boyd in the 90’s, exact knapsack separation has recently found renewed interest. In this paper we present a “lightweight” exact separation procedure for mixed knapsack sets and perform a computatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 30 شماره
صفحات -
تاریخ انتشار 2002